On - and -Linear Lifts of the Golay Codes
نویسندگان
چکیده
We analyze 4and 9-linear lifts of the binary [24; 12] and ternary [12; 6]-Golay code under different weight functions on the underlying ring, and present algebraic decoding schemes for these codes.
منابع مشابه
On the Weight Enumerators of the Projections of the 2-adic Golay Code of Length 24 to Z2e
In [2], Calderbank and Sloane investigated codes over the p-adics and examined lifts of codes over Zp to Zpe and to the p-adics. They described the [8, 4, 5] 2-adic Hamming code, the [24, 12, 13] 2-adic Golay code, and the [12, 6, 7] 3-adic Golay code. These three codes are all self-dual and MDS. In [3], Dougherty, Kim, and Park gave the weight distribution of the projections of these three cod...
متن کاملOn Construction of the (24,12,8) Golay Codes
—Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8, 4, 4) linear block component codes for generating the Golay code, and it generates and extends previously existing methods that use a similar construction framework. The code constructed is simple to decode.
متن کاملON THE LIFTS OF SEMI-RIEMANNIAN METRICS
In this paper, we extend Sasaki metric for tangent bundle of a Riemannian manifold and Sasaki-Mok metric for the frame bundle of a Riemannian manifold [I] to the case of a semi-Riemannian vector bundle over a semi- Riemannian manifold. In fact, if E is a semi-Riemannian vector bundle over a semi-Riemannian manifold M, then by using an arbitrary (linear) connection on E, we can make E, as a...
متن کاملAcyclic Tanner Graphs and Maximum-Likelihood Decoding of Linear Block Codes
The maximum-likelihood decoding of linear block codes by the Wagner rule decoding is discussed. In this approach, the Wagner rule decoding which has been primarily applied to single parity check codes is employed on acyclic Tanner graphs. Accordingly, a coset decoding equipped with the Wagner rule decoding is applied to the decoding of a code C having a Tanner graph with cycles. A subcode C1 of...
متن کاملAn Assmus-Mattson theorem for Z4-codes
The Assmus{Mattson theorem is a method to nd designs in linear codes over a nite eld. The purpose of this paper is to give an analogue of this theorem for Z 4 -codes by using the harmonic weight enumerator which is introduced by Bachoc. This theorem can nd some 5-designs in the lifted Golay code over Z 4 which were discovered previously by other methods. Index Terms { Z 4 -codes, Assmus{Mattson...
متن کامل